An Absorbing Markov Chain Approach to GI/M/1 Queues with Generalized Vacations
نویسندگان
چکیده
1 Q I − − ) ( y , where the j th entry of the row vector y is the probability that the system state seen by the first arrival during a busy period is j and 1 Q I − − ) ( is the fundamental matrix associated with the standard GI/M/1 queue. In this paper, we present the entries of 1 Q I − − ) ( explicitly. Also, we illustrate how to find y by examples such as the N -policy GI/M/1 queue with or without exponential multiple vacations.
منابع مشابه
Logarithmic Asymptotics for the GI/G/1-type Markov Chains and their Applications to the BMAP/G/1 Queue with Vacations
We study tail asymptotics of the stationary distribution for the GI=G=1-type Markov chain with finitely many background states. Decay rate in the logarithmic sense is identified under a number of conditions on the transition probabilities. The results are applied to the BMAP=G=1 queuewith vacations. The relationship between vacation time and the decay rate of the queue length distribution is in...
متن کاملA Unified Method to Analyze Overtake Free Queueing Systems
In this paper we demonstrate that the distributional laws that relate the number of customers in the system (queue), L(Q) and the time a customer spends in the system (queue), S(W) under the first-in-first-out (FIFO) discipline are special cases of the H = AG law and lead to a complete solution for the distributions of L, Q, S, W for queueing systems which satisfy distributional aws for both L ...
متن کاملAbsorbing Markov Chain Models to Determine Optimum Process Target Levels in Production Systems with Rework and Scrapping
In this paper, absorbing Markov chain models are developed to determine the optimum process mean levels for both a single-stage and a serial two-stage production system in which items are inspected for conformity with their specification limits. When the value of the quality characteristic of an item falls below a lower limit, the item is scrapped. If it falls above an upper limit, the item is ...
متن کاملOn the Waiting Time in the GI/M/1 Vacations Queues with Dependency Between Interarrival and Service Times
We derive the waiting time distribution in a GI/M/1 queueing system with dependence between the service time of each customer and the subsequent interarrival times. In addition, the server takes exponentially distributed vacations when there are no customers left to serve in the queue.
متن کاملOn the Relaxation Time for Single Server Queues
This paper gives a natural definition of the relaxation time for general single server queues. First, we describe a GI/GI/I queue as a limit of GI/GPH/I queues. Each GI/GPH/I queue is transferred to some equivalent bulk arrival GIx/M/I queue, which is formulated by a spatially homogeneous Markov chain with reflecting barrior at zero. An upper bound, which is easy to calculate, of the relaxation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005